F-reducers in finite soluble groups
نویسندگان
چکیده
منابع مشابه
On weakly $mathfrak{F}_{s}$-quasinormal subgroups of finite groups
Let $mathfrak{F}$ be a formation and $G$ a finite group. A subgroup $H$ of $G$ is said to be weakly $mathfrak{F}_{s}$-quasinormal in $G$ if $G$ has an $S$-quasinormal subgroup $T$ such that $HT$ is $S$-quasinormal in $G$ and $(Hcap T)H_{G}/H_{G}leq Z_{mathfrak{F}}(G/H_{G})$, where $Z_{mathfrak{F}}(G/H_{G})$ denotes the $mathfrak{F}$-hypercenter of $G/H_{G}$. In this paper, we study the structur...
متن کاملConstructing Normalisers in Finite Soluble Groups
This paper describes algorithms for constructing a Hall n-subgroup H of a finite soluble group G and the normaliser No(H). If G has composition length n, then H and No(H ) can be constructed using O(n ~ log IGI) and O(n ~ log IGI) group multiplications, respectively. These algorithms may be used to construct other important subgroups such as Carter subgroups, system normalisers and relative sys...
متن کاملintersections of prefrattini subgroups in finite soluble groups
let $h$ be a prefrattini subgroup of a soluble finite group $g$. in the paper it is proved that there exist elements $x,y in g$ such that the equality $h cap h^x cap h^y = phi (g)$ holds.
متن کاملComputing automorphisms of finite soluble groups
There is a large collection of e ective algorithms for computing information about nite soluble groups. The success in computation with these groups is primarily due to a computationally convenient representation of them by means of (special forms of) power conjugate presentations. A notable omission from this collection of algorithms is an e ective algorithm for computing the automorphism grou...
متن کاملCENTRALISERS OF FINITE SUBGROUPS IN SOLUBLE GROUPS OF TYPE FPn
We show that for soluble groups of type FPn, centralisers of finite subgroups need not be of type FPn.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1971
ISSN: 0021-8693
DOI: 10.1016/0021-8693(71)90140-2